By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Optimization

Table of Contents
Volume 18, Issue 4, pp. 1129-1503

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

Structural Topology Optimization with Eigenvalues

Wolfgang Achtziger and Michal Kočvara

pp. 1129-1164

Successive Linear Approximation Solution of Infinite-Horizon Dynamic Stochastic Programs

John R. Birge and Gongyun Zhao

pp. 1165-1186

The Adaptive Convexification Algorithm: A Feasible Point Method for Semi-Infinite Programming

Christodoulos A. Floudas and Oliver Stein

pp. 1187-1208

On the Convergence of Augmented Lagrangian Methods for Constrained Global Optimization

H. Z. Luo, X. L. Sun, and D. Li

pp. 1209-1230

Mathematical Programming Problems Governed by Nonlinear Elliptic PDEs

M. D. Voisei

pp. 1231-1249

Perturbation Bounds of P-Matrix Linear Complementarity Problems

Xiaojun Chen and Shuhuang Xiang

pp. 1250-1265

Statistical Quasi-Newton: A New Look at Least Change

Chuanhai Liu and Scott A. Vander Wiel

pp. 1266-1285

On Augmented Lagrangian Methods with General Lower-Level Constraints

R. Andreani, E. G. Birgin, J. M. Martínez, and M. L. Schuverdt

pp. 1286-1309

On Handling Free Variables in Interior-Point Methods for Conic Linear Optimization

Miguel F. Anjos and Samuel Burer

pp. 1310-1325

Exact Regularization of Convex Programs

Michael P. Friedlander and Paul Tseng

pp. 1326-1350

Proximal Thresholding Algorithm for Minimization over Orthonormal Bases

Patrick L. Combettes and Jean-Christophe Pesquet

pp. 1351-1376

On Mehrotra-Type Predictor-Corrector Algorithms

M. Salahi, J. Peng, and T. Terlaky

pp. 1377-1397

Efficient Reduction of Polynomial Zero-One Optimization to the Quadratic Case

Christoph Buchheim and Giovanni Rinaldi

pp. 1398-1413

A High-Order Path-Following Method for Locating the Least 2-Norm Solution of Monotone LCPs

Anhua Lin

pp. 1414-1435

Explicit Reformulations for Robust Optimization Problems with General Uncertainty Sets

Igor Averbakh and Yun-Bin Zhao

pp. 1436-1466

A Method of Centers with Approximate Subgradient Linearizations for Nonsmooth Convex Optimization

Krzysztof C. Kiwiel

pp. 1467-1489

Improved Approximation Algorithms for Weighted Hypergraph Embedding in a Cycle

Hann-Jang Ho and SingLing Lee

pp. 1490-1500

Erratum: Mesh Adaptive Direct Search Algorithms for Constrained Optimization

Charles Audet, A. L. Custódio, and J. E. Dennis, Jr.

pp. 1501-1503